On the Modularity of Normal Forms in Rewriting
نویسنده
چکیده
The last open problem regarding the modularity of the fundamental properties of Term Rewriting Systems concerns the property of uniqueness of normal forms w r t reduction UN In this article we solve this open problem showing that UN is modular for left linear Term Rewriting Systems The novel pile and delete technique here introduced allows for quite a short proof and is of independent interest in the study of modu lar properties Moreover we also study the modularity of consistency w r t reduction CON showing its modularity for left linear Term Rewriting Systems
منابع مشابه
On the Modularity of Normal Forms in
The last open problem regarding the modularity of the fundamental properties of Term Rewriting Systems concerns the property of uniqueness of normal forms w.r.t. reduction (UN !). In this article we solve this open problem,showing that UN ! is modular for left-linear Term Rewriting Systems. The noveìpile and delete' technique here introduced allows for quite a short proof, and is of independent...
متن کاملMining Overlapping Communities in Real-world Networks Based on Extended Modularity Gain
Detecting communities plays a vital role in studying group level patterns of a social network and it can be helpful in developing several recommendation systems such as movie recommendation, book recommendation, friend recommendation and so on. Most of the community detection algorithms can detect disjoint communities only, but in the real time scenario, a node can be a member of more than one ...
متن کاملUniqueness of Normal Forms and Modularity of Confluence for Term Rewriting Systems
Programming language interpreters, proving theorems of the form A = B, abstract data types and program optimization can all be represented by a finite set of rules called a rewrite system. In this paper, we study two fundamental concepts, uniqueness of normal forms and confluence, for nonlinear systems in the absence of termination. This is a difficult topic with only a few results so far. Thro...
متن کاملAbstract Modularity
Modularity Michael Abbott, Neil Ghani, and Christoph Lüth 1 Department of Mathematics and Computer Science, University of Leicester [email protected], [email protected] 2 FB 3 – Mathematik und Informatik, Universität Bremen [email protected] Abstract. Modular rewriting seeks criteria under which rewrite systems Modular rewriting seeks criteria under which rewrite systems inheri...
متن کاملDecidable call-by-need computations in term rewriting
The theorem of Huet and Lévy stating that for orthogonal rewrite systems (i) everyreducible term contains a needed redex and (ii) repeated contraction of neededredexes results in a normal form if the term under consideration has a normal form,forms the basis of all results on optimal normalizing strategies for orthogonal rewritesystems. However, needed redexes are not computable...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 22 شماره
صفحات -
تاریخ انتشار 1996